新疆民俗数学文化探析

新疆民俗数学是具有鲜明民族特色、独特价值和丰富文化内涵的数学思想与思维方式的综合。新疆民俗数学较多地体现在用于造型和装饰的清真寺、民居、民族手工艺品等方面的几何纹饰上。对于民俗数学的研究，一方面是通过对这些集数学知识与传统文化于一体的“文化载体”的搜集、整理和分析，分析其蕴含的数学知识和数学思想；另一方面则关注民俗数学研究成果的教育学转化，在充分考虑新疆少数民族儿童数学认知思维特征以及数学双语教学原则、方法等的基础上，通过实现民俗数学的“课程化”，以弥补当前新疆少数民地区以“主流文化”为主导的数学课程对少数民族传统文化的“缺失”，进而推进本地区基础教育课程改革和数学教育质量的提升。     

机务保障要求到保障方案转换

首先以装备可靠性为依据,以任务要求中任务时间、出动飞机数量、任务可靠度等参数为约束,建立了保障资源的配置模型;在确定保障资源配置基础上再以保障任务时间为优化目标,建立保障任务调度模型和调度算法,按照保障专业调度优化,为保障方案制定奠定了重要基础,对实行精确化保障有重要现实意义,对基层级的保障工作有很强的指导作用。     

Revenue management with aircraft reassignment flexibility

A well‐studied problem in airline revenue management is the optimal allocation of seat inventory among different fare‐classes, given a capacity for the flight and a demand distribution for each class. In practice, capacity on a flight does not have to be fixed; airlines can exercise some flexibility on the supply side by swapping aircraft of different capacities between flights as partial booking information is gathered. This provides the airline with the capability to more effectively match their supply and demand. In this paper, we study the seat inventory control problem considering the aircraft swapping option. For theoretical and practical purposes, we restrict our attention to the class of booking limit policies. Our analytical results demonstrate that booking limits considering the swapping option can be considerably different from those under fixed capacity. We also show that principles on the relationship between the optimal booking limits and demand characteristics (size and risk) developed for the fixed‐capacity problem no longer hold when swapping is an option. We develop new principles and insights on how demand characteristics affect the optimal booking limits under the swapping possibility. We also develop an easy to implement heuristic for determining the booking limits under the swapping option and show, through a numerical study, that the heuristic generates revenues close to those under the optimal booking limits. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

A1 Qaeda and the radical Islamic challenge to western strategy

The September 11 global crisis prompted by the attacks on the World Trade Center and the Pentagon raises major questions concerning the nature and trajectory of terrorism in the post-Cold War global order. Hitherto, terrorism has been largely debated by analysts at the level of nation states. Terrorist and insurgent movements have also been largely anchored in nationalist and ethnic power bases even when they have sought to mobilise a transnational ideological appeal on religious or class grounds. There have been a few exceptions to this pattern such as the alliance between the German Baader-Meinhof group and the Japanese Red Army Faction, but even such international alliances as this did not, until at least the 1980s, presage anything like a global terrorist network necessitating a global strategic response. This study examines terrorism and global strategic responses.     

任务驱动下航材需求量的GA-GM-BP预测

机务保障影响着航空装备战斗力的生成,机务保障资源是任务成功率的物质支撑.基于航材需求信息的灰色性,通过采用DEMATEL方法提取影响航空备件需求量的关键影响因素,采用遗传算法优化的灰色神经网络对需求量进行了仿真预测,其预测精度较BP神经网络和灰色神经网络都高.该方法对于其他航空机务保障资源的需求预测有借鉴意义.     

基于遗传算法的多功能电子系统任务调度

雷达、通信、电子战等多功能一体化是未来作战平台电子系统的发展方向之一,任务优化调度技术是多功能电子系统的关键技术。针对多功能电子系统射频任务调度问题,在建立任务调度数学模型的基础上,采用了改进的遗传算法对模型进行了求解,提出了任务列表和随机键结合的编码方式,设计了以执行时间最短和任务丢失率最小为目标的多目标适应度函数,采用轮盘赌选择、改进型双点交叉和对称交换变异方式设计遗传操作。通过仿真实验,验证了所设计任务调度方法的有效性和优越性。     

资源约束条件下的空中兵力编组

通过对空中兵力的合理编组,实现作战资源的优化配置是提升兵力作战效能的有效途径。针对现代空战编队对抗过程的特点,从战术企图和信息优势角度提出了编队目标威胁评估方法。以编队目标为研究对象从宏观上调配己方作战资源,提出了作战资源成本和兵力调度成本2种兵力编组成本,在此基础上建立了资源约束条件下的兵力编组优化模型,并采用改进PSO算法对模型进行求解。作战想定仿真结果表明兵力编组模型能够有效解决空战兵力分配问题。     

动态规划在消防增援调度中的应用

由于各消防中队一般规模较小，对于较大规模的火灾需要多个消防队共同救护，此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究，并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况，以实现最大程度地减小经济损失。     

太空快速响应发射场能力建设

为实现战争行动和突发事件的快速响应目的,太空快速响应发射已成为重要的解决手段。总结传统航天发射场面临的挑战,分析了太空快速响应活动对航天发射场的需求,从发射场建设需求体系、发射场测试能力推进、发射场改造和补充建设、天地一体测控通信体系、快速机动发射模式等提出了发射场建设发展途径,为满足太空快速响应发射场系统建设提供有益的技术参考。